Packing problems - PDFSEARCH.IO - Document Search Engine

Packing problems
Results: 74

#	Item
31	Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English) Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Operations research Dynamic programming Combinatorial optimization Packing problems Cryptography Knapsack problem Subset sum problem Approximation algorithm Algorithm Greedy algorithm Heuristic Branch and bound
32	Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2014-06-25 03:14:23 Computational complexity theory Theory of computation Complexity classes Packing problems NP-complete problems Bin packing problem Approximation algorithms Polynomial-time approximation scheme Partition problem NP NC Time complexity
33	Ant Colony Optimization and Aggressive Local Search applied to Bin Packing and Cutting Stock Problems John Levine and Frederick Ducatelle Add to Reading List Source URL: www.aiai.ed.ac.uk Language: English - Date: 2003-05-30 07:35:21
34	APPROXIMATION ALGORITHMS FOR COVERING AND PACKING PROBLEMS ON PATHS ARINDAM PAL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Add to Reading List Source URL: www.cse.iitd.ac.in Language: English - Date: 2014-01-25 10:56:26
35	Elliptic PDEs, vibrations of a plate, set discrepancy and packing problems Stefan Steinerberger Mathematisches Institut Universit¨ at Bonn Add to Reading List Source URL: www.mathematik.uni-kl.de Language: English - Date: 2013-10-23 08:17:32
36	CPS296.2 Geometric Optimization March, Lecture 17: Covering, Packing, and Art-Gallery Problems Lecturer: Pankaj K. Agarwal Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-04-11 16:05:32
37	Multi-dimensional Bin Packing Problems with Guillotine Constraints Rasmus R. Amossen∗ David Pisinger† Add to Reading List Source URL: rasmus.resen.org Language: English - Date: 2010-02-22 06:25:40
38	UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003 Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Bin packing problem NP Subset sum problem Partition problem Vertex cover Integer 3-partition problem Theoretical computer science Mathematics Computational complexity theory
39	A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:58:37 NP-complete problems Combinatorics Analysis of algorithms Set packing Randomized algorithm Disjoint-set data structure Parameterized complexity Set cover problem Dominating set Theoretical computer science Computational complexity theory Mathematics
40	16th Canadian Conference on Computational Geometry, 2004 On Computing Enclosing Isosceles Triangles and Related Problems Prosenjit Bose Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Circles Triangle Circle packing in an isosceles right triangle Packing problem Geometry Triangles Triangle geometry